Trees

1. Binary trees
2. Proper binary trees
3. DFS and BFS: tree traversal algorithms


------------------------------------------------
Binary search trees: 

- Example#1: in-order traversal (AlgoExpert): Find the kth largest values in BST

- Example#2: LeetCode700: 

- Example#3: Constructing a BST (LeetCode 108)

--------------------------------------------------

nE = nI + 1

proper binary tree: 

nb 
nodes = nb of edges + 1

nE + nI = 0nE + 2nI + 1 => nE = nI + 1;

The End...









